Nearly MDS expander codes with reduced alphabet size
نویسندگان
چکیده
Recently, Roth and Skachek proposed two methods for constructing nearly maximum-distance separable (MDS) expander codes. We show that through the simple modification of using mixed-alphabet codes derived from MDS codes as constituent codes in their code designs, one can obtain nearly MDS codes of significantly smaller alphabet size, albeit at the expense of a (very slight) reduction in code rate.
منابع مشابه
Ja n 20 06 Improved Nearly - MDS Expander Codes ∗
A construction of expander codes is presented with the following three properties: (i) the codes lie close to the Singleton bound, (ii) they can be encoded in time complexity that is linear in their code length, and (iii) they have a linear-time bounded-distance decoder. By using a version of the decoder that corrects also erasures, the codes can replace MDS outer codes in concatenated construc...
متن کاملLow-Density Parity-Check Codes: Constructions and Bounds
Low-density parity-check (LDPC) codes were introduced in 1962, but were almost forgotten. The introduction of turbo-codes in 1993 was a real breakthrough in communication theory and practice, due to their practical effectiveness. Subsequently, the connections between LDPC and turbo codes were considered, and it was shown that the latter can be described in the framework of LDPC codes. In recent...
متن کاملOptimal Coding for the Erasure Channel with Arbitrary Alphabet Size
An erasure channel with a fixed alphabet size q, where q ≫ 1, is studied . It is proved that over any erasure channel (with or without memory), Maximum Distance Separable (MDS) codes achieve the minimum probability of error (assuming maximum likelihood decoding). Assuming a memoryless erasure channel, the error exponent of MDS codes are compared with that of random codes and linear random codes...
متن کاملElias Upper Bound for Euclidean Space Codes and Codes Close to the Singleton Bound
A typical communication system consists of a channel code to transmit signals reliably over a noisy channel. In general the channel code is a set of codewords which are used to carry information over the channel. This thesis deals with Elias upper bound on the normalized rate for Euclidean space codes and on codes which are close to the generalized Singleton bound, like MaximumDistance Separabl...
متن کاملThe Partition Weight Enumerator and Bounds on Mds Codes
Maximum Distance Separable (MDS) codes are those error correction codes that meet the singleton bound, thus they have the largest minimum distance possible. The main research problem is to find an upper bound on the length of the codewords when the alphabet size and dimension of the code are fixed. This paper will present a new technique using the Partition Weight Enumerator for solving this pr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/0708.1078 شماره
صفحات -
تاریخ انتشار 2007